k-Balanced games and capacities

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

k-Balanced games and capacities

In this paper we present a generalization of the concept of balanced game for finite games. Balanced games are those having a nonempty core, and this core is usually considered as the solution of the game. Based on the concept of k-additivity, we define the so-called k-balanced games and the corresponding generalization of core, the k-additive core, whose elements are not directly imputations b...

متن کامل

Capacities on lattices and k-ary capacities

We propose a general notion of capacity defined on any finite distributive lattice, encompassing usual capacities, bi-capacities, and their immediate extensions called k-ary capacities. We define key notions such as Möbius transform, derivative, Shapley value and Choquet integral.

متن کامل

Games and Capacities on Partitions

We consider capacities and games whose value v(S) depend on the organization of N \ S, this organization being represented by a partition. Hence we deal with capacities and games depending on two arguments: a subset (coalition) S and a partition π containing S. We call embedded coalition any such pair (S, π). We first provide a suitable structure for the set of embedded coalitions, study its pr...

متن کامل

Balanced environmental games

Focus is here on coalitional games among economic agents plagued by aggregate pollutions of diverse sorts. Defecting players presumably pollute more than others. Then, granted convex preferences and technologies, the core is proven nonempty. In fact, under natural assumptions, a specific, computable core solution comes in terms of shadow prices on the said aggregates. Such prices may, in large ...

متن کامل

k-intolerant capacities and Choquet integrals

We define an aggregation function to be (at most) k-intolerant if it is bounded from above by its kth lowest input value. Applying this definition to the discrete Choquet integral and its underlying capacity, we introduce the concept of k-intolerant capacities which, when varying k from 1 to n, cover all the possible capacities on n objects. Just as the concepts of k-additive capacities and p-s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2010

ISSN: 0377-2217

DOI: 10.1016/j.ejor.2008.12.020